Verification of Infinite-state Systems
نویسنده
چکیده
The development of our modern societies needs more and more involvement of computers in managing highly complex and (safety-)critical tasks, e.g., in telecommunication, chemical and physical process control, transportation systems, etc. It is essential to be able to produce reliable hardware and software systems, since any erroneous behaviour can have catastrophic (economical and human) consequences. This requires rigorous methods and techniques to conceive, analyze and validate these systems. The verification problem consists in checking whether a system satisfies its specification. During the two last decades, significant achievements have been obtained in the case of finite-state systems (systems with finitely many states). One of the main actual challenges in the domain of automated verification is the conception of methods and tools allowing to deal with verification problems beyond the finite-state framework. Such problems rise naturally as soon as we consider aspects like:
منابع مشابه
Verification of infinite-state dynamic systems using approximate quotient transition systems
This paper concerns computational methods for verifying properties of labeled infinite-state transition systems (e.g., hybrid systems) using quotient transition system (QTS). A QTS is a conservative approximation to the infinite-state transition system based on a finite partition of the infinite state space. For universal specifications, positive verification for a QTS implies the specification...
متن کاملAbstraction and Learning for Infinite-State Compositional Verification
Despite many advances that enable the application of model checking techniques to the verification of large systems, the state-explosion problem remains the main challenge for scalability. Compositional verification addresses this challenge by decomposing the verification of a large system into the verification of its components. Recent techniques use learning-based approaches to automate compo...
متن کاملAbstraction and Modular Verification of Infinite-State Reactive Systems
ion and Modular Verification of Infinite-State Reactive Systems ⋆ Zohar Manna, Michael A. Colón, Bernd Finkbeiner, Henny B. Sipma and Tomás E. Uribe Computer Science Department Stanford University Stanford, CA. 94305-9045 [email protected] Abstract. We review a number of temporal verification techniques for reactive systems using modularity and abstraction. Their use allows the verification...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملVerification of recursive parallel systems
In this paper we consider the problem of proving properties of infinite behaviour of formalisms suitable to describe (infinite state) systems with recursion and parallelism. As a formal setting, we consider the framework of Process Rewriting Systems (PRS s). For a meaningfull fragment of PRS s, allowing to accommodate both Pushdown Automata and Petri Nets, we state decidability results for a cl...
متن کاملProgram Specialization for Verifying Infinite State Systems: An Experimental Evaluation
We address the problem of the automated verification of temporal properties of infinite state reactive systems. We present some improvements of a verification method based on the specialization of constraint logic programs (CLP). First, we reformulate the verification method as a two-phase procedure: (1) in the first phase a CLP specification of an infinite state system is specialized with resp...
متن کامل